- partially ordered group
- частично упорядоченная группа
English-Russian scientific dictionary. 2008.
English-Russian scientific dictionary. 2008.
Partially-ordered group — In abstract algebra, a partially ordered group is a group (G,+) equipped with a partial order ≤ that is translation invariant; in other words, ≤ has the property that, for all a, b, and g in G, if a ≤ b then a+g ≤ b+g and g+a ≤ g+b. An element x… … Wikipedia
Ordered group — In abstract algebra, an ordered group is a group (G,+) equipped with a partial order ≤ which is translation invariant ; in other words, ≤ has the property that, for all a , b , and g in G , if a ≤ b then a+g ≤ b+g and g+a ≤ g+b . Note that… … Wikipedia
Partially ordered set — The Hasse diagram of the set of all subsets of a three element set {x, y, z}, ordered by inclusion. In mathematics, especially order theory, a partially ordered set (or poset) formalizes and generalizes the intuitive concept of an ordering,… … Wikipedia
Cyclically ordered group — In mathematics, a cyclically ordered group is a set with both a group structure and a cyclic order, such that left and right multiplication both preserve the cyclic order. Cyclically ordered groups were first studied in depth by Ladislav Rieger… … Wikipedia
Profinite group — In mathematics, profinite groups are topological groups that are in a certain sense assembled from finite groups; they share many properties with their finite quotients. Definition Formally, a profinite group is a Hausdorff, compact, and totally… … Wikipedia
Outline of algebraic structures — In universal algebra, a branch of pure mathematics, an algebraic structure is a variety or quasivariety. Abstract algebra is primarily the study of algebraic structures and their properties. Some axiomatic formal systems that are neither… … Wikipedia
Ordinal optimization — In mathematical optimization, ordinal optimization is the maximization of functions taking values in a partially ordered set ( poset ). Ordinal optimization has applications in the theory of queuing networks. Contents 1 Mathematical foundations 1 … Wikipedia
List of algebraic structures — In universal algebra, a branch of pure mathematics, an algebraic structure is a variety or quasivariety. Abstract algebra is primarily the study of algebraic structures and their properties. Some axiomatic formal systems that are neither… … Wikipedia
Cyclic order — In mathematics, a cyclic order is a way to arrange a set of objects in a circle.[nb] Unlike most structures in order theory, a cyclic order cannot be modeled as a binary relation a < b . One does not say that east is more clockwise than west.… … Wikipedia
Galois connection — In mathematics, especially in order theory, a Galois connection is a particular correspondence between two partially ordered sets (posets). Galois connections generalize the correspondence between subgroups and subfields investigated in Galois… … Wikipedia
Refinement monoid — In mathematics, a refinement monoid is a commutative monoid M such that for any elements a0, a1, b0, b1 of M such that a0+a1=b0+b1, there are elements c00, c01, c10, c11 of M such that a0=c00+c01, a1=c10+c11, b0=c00+c10, and b1=c01+c11. A… … Wikipedia